DEEP: Dual-Space Expansion for Estimating Penetration Depth Between Convex Polytopes
نویسندگان
چکیده
We present an incremental algorithm to estimate the penetration depth between convex polytopes in 3D. The algorithm incrementally seeks a “locally optimal solution” by walking on the surface of the Minkowski sums. The surface of the Minkowski sums is computed implicitly by constructing a local Gauss map. In practice, the algorithm works well when there is high motion coherence in the environment and is able to compute the optimal solution in most cases. Keywords— Penetration Depth, Minkowski Sums, In-
منابع مشابه
Proximity Queries and Penetration Depth Computation on 3D Game Objects
This paper discusses methods for performing proximity queries (collision detection, distance computation) and penetration depth computation on a large class of convex objects. The penetration depth of a pair of intersecting objects is the shortest vector over which one object needs to be translated in order to bring the pair in touching contact. The class of objects includes convex primitives s...
متن کاملClosest Point Query among the Union of Convex Polytopes Using Rasterization Hardware
We present a novel approach using rasterization hardware to perform the following query: Given a collection of convex polytopes in 3D, find the closest point from some given point inside the polytopes to the surface of the union of the polytopes. The algorithm takes advantage of multi-pass rendering, clipping and depth tests. We also demonstrate its application to penetration depth computation.
متن کاملPEG: A geometrically exact contact model for polytopes
We present a formulation of non-penetration constraint between pairs of polytopes which accounts for all possible combinations of active contact between geometric features. This is the first formulation that exactly models the body geometries near points of potential contact, preventing interpenetration while not over-constraining body motions. Unlike many popular methods, ours does not wait fo...
متن کاملPoints in Two Polytopes
We propose a separating-hyperplane algorithm for finding a nearest pair of points in two polytopes, where each polytope is expressed as the convex hull of given points in a Euclidian space. The proposed algorithm is an extension of the authors dual algorithm for finding t.he minimum-norm point in a polytope.
متن کاملComputing the Penetration Depth of Two Convex Polytopes in 3D
Let A and B be two convex polytopes in R 3 with m and n facets, respectively. The penetration depth of A and B, denoted as (A; B), is the minimum distance by which A has to be translated so that A and B do not intersect. We present a randomized algorithm that computes (A; B) in O(m 3=4+" n 3=4+" + m 1+" + n 1+") expected time, for any constant " > 0. It also computes a vector t such that ktk = ...
متن کامل